Informative labeling schemes for graphs
نویسندگان
چکیده
منابع مشابه
Informative Labeling Schemes for Graphs
This paper introduces the notion of informative labeling schemes for arbitrary graphs. Let f (W) be a function on subsets of vertices W . An f labeling scheme labels the vertices of a weighted graph G in such a way that f (W) can be inferred (or at least approximated) efficiently for any vertex subset W of G by merely inspecting the labels of the vertices of W, without having to use any additio...
متن کاملInformative Labeling Schemes for the Least Common Ancestor Problem
We address the problem of labeling the nodes of a tree such that one can determine the identifier of the least common ancestor of any two nodes by looking only at their labels. This problem has application in routing and in distributed computing in peer-to-peer networks. A labeling scheme using Θ(log n)-bit labels has been presented by Peleg. By engineering this scheme and a new one due to the ...
متن کاملLabeling Schemes for Bounded Degree Graphs
We investigate adjacency labeling schemes for graphs of bounded degree ∆ = O(1). In particular, we present an optimal (up to an additive constant) log n+ O(1) adjacency labeling scheme for bounded degree trees. The latter scheme is derived from a labeling scheme for bounded degree outerplanar graphs. Our results complement a similar bound recently obtained for bounded depth trees [Fraigniaud an...
متن کاملDistributed Data Structures: A Survey on Informative Labeling Schemes
In this talk, we will survey the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized d...
متن کاملNear Optimal Adjacency Labeling Schemes for Power-Law Graphs
An adjacency labeling scheme labels the n nodes of a graph with bit strings in a way that allows, given the labels of two nodes, to determine adjacency based only on those bit strings. Though many graph families have been meticulously studied for this problem, a non-trivial labeling scheme for the important family of power-law graphs has yet to be obtained. This family is particularly useful fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.03.015